Another Look on Recursion Operators
نویسنده
چکیده
Recursion operators of partial diierential equations are identiied with BB acklund auto-transformations of linearized diieties. Relations to the classical concept and its recent Guthrie's generalization are discussed. Traditionally,a recursion operator of a PDE is a linear operator L acting on symmetries: if f is a symmetry then so is Lf. This provides a convenient way to generate innnite families of symmetries (Olver 13]). Standard reference is 14]. The presence of a recursion operator has been soon recognized as one of the attributes of the complete integrability. An exact and rich theory has been developed within the class of evolution equations (see Fokas 2] and references therein). Recursion operators are, as a rule, nonlocal and so may turn out to be the symmetries they generate (giving a powerful source of nonlocal symmetries 10, 5]). A remarkable problem of inverting a recursion operator motivated Guthrie 3] to a generalization, with consequences for generation of nonlocal symmetries 4]. His nonlocalities are no longer limited to mere inverses D ?1 of total derivatives. It seems to be an interesting problem to give an interpretation of recursion operators in terms of the Vinogradov 17] category of diieties. Recently, Krasilshchik and Kersten 6, 8] established a fundamental relation between recursion operators and deformations of diiety structures. In this paper (Section 3) we propose another answer, according to which recur-sion operators are BB acklund auto-transformations of so called linearized diiety (Section 2). Classical recursion operators are discussed in Section 4. The Guthrie operators turn out to be equivalent to what we call nitary linear operators, in the case of two independent variables (Section 5). To cover known examples in multi-dimension (e.g., the KP equation in 2]) nitary constructions are manifestly insuf-cient, but a theory of innnitary coverings still awaits a necessary development. In
منابع مشابه
Structured recursion for non-uniform data-types
Recursion is a simple but powerful programming technique used extensively in functional languages. For a number of reasons, however, it is often desirable to use structured forms of recursion in programming, encapsulated in so-called recursion operators, in preference to unrestricted recursion. In particular, using recursion operators has proved invaluable for transforming and reasoning about f...
متن کاملAbstracts of the invited speakers
s of the invited speakers Dag Normann, University of Oslo, Norway Revisiting Transfinite Types In this talk I will reconstruct spaces of countable and uncountable transfinite types, this time using limit spaces. This approach turns out to give a better access to internal concepts of computability for such spaces. The talk will be a report on ongoing research. This research is rooted in earlier ...
متن کاملDual Pairs in Quantum
[UW] T. Umeda and M. Wakayama, Another look at the dierential operators on quantum matrix spaces and its applications, in preparation.
متن کاملDependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion
We present a variation of Martin-Löf’s logical framework with βιequality, extended with first-order parameterized algebraic data types and recursive pattern-matching definitions. Our contribution is a proof of normalization for the proposed system, from which we obtain decidable type-correctness. Our result holds under the assumption that the call relation of the recursive definitions is well-f...
متن کاملOn construction of recursion operators from Lax representation
In this work we develop a general procedure for constructing the recursion operators for non-linear integrable equations admitting Lax representation. Several new examples are given. In particular we find the recursion operators for some KdV-type systems of integrable equations.
متن کامل